DTN routing for quasi-deterministic networks with application to LEO constellations

We propose a novel DTN routing algorithm, called DQN, specifically designed for quasideterministic networks with an application to satellite constellations. We demonstrate that our proposal efficiently forwards the information over a satellite network derived from the Orbcomm topology while keeping a low replication overhead. We compare our algorithm against other wellknown DTN routing schemes and show that we obtain the lowest replication ratio with a delivery ratio of the same order of magnitude than a reference theoretical optimal routing. We also analyse the impact of terrestrial gateways density and analyse DQN performances in heterogeneous cases.